Verification as Learning Geometric Concepts

نویسندگان

  • Rahul Sharma
  • Saurabh Gupta
  • Bharath Hariharan
  • Alexander Aiken
  • Aditya V. Nori
چکیده

We formalize the problem of program verification as a learning problem, showing that invariants in program verification can be regarded as geometric concepts in machine learning. Safety properties define bad states: states a program should not reach. Program verification explains why a program’s set of reachable states is disjoint from the set of bad states. In Hoare Logic, these explanations are predicates that form inductive assertions. Using samples for reachable and bad states and by applying well known machine learning algorithms for classification, we are able to generate inductive assertions. By relaxing the search for an exact proof to classifiers, we obtain complexity theoretic improvements. Further, we extend the learning algorithm to obtain a sound procedure that can generate proofs containing invariants that are arbitrary boolean combinations of polynomial inequalities. We have evaluated our approach on a number of challenging benchmarks and the results are promising.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Geometric Verification for Large Scale Landmark Image Collections

In this work, we address the issue of geometric verification, with a focus on modeling large-scale landmark image collections gathered from the internet. In particular, we show that we can compute and learn descriptive statistics pertaining to the image collection by leveraging information that arises as a by-product of the matching and verification stages. Our approach is based on the intuitio...

متن کامل

Geometric Concept Learning

Geometric concepts play a major role in machine learning. Neural networks with linear threshold gates can be interpreted as geometrical concepts with linear bounding hyper-planes. Early work on perceptron learning was in essence an investigation into learnability of linear half-spaces. Further, geometrical concepts like convex polyhedra and unions of axis-parallel boxes can be viewed as a conti...

متن کامل

Evolutionary minimum verification error learning of the alternative hypothesis model for LLR-based speaker verification

It is usually difficult to characterize the alternative hypothesis precisely in a log-likelihood ratio (LLR)-based speaker verification system. In a previous work, we proposed using a weighted arithmetic combination (WAC) or a weighted geometric combination (WGC) of the likelihoods of the background models instead of heuristic combinations, such as the arithmetic mean and the geometric mean, to...

متن کامل

Determination of geometric accuracy of radiotherapy fields by port film and DRR using Matlab Graphical User Interface

Introduction: Radiation therapy is one of the methods of cancer treatment. In this method, it is necessary to avoid harming the healthy tissues of the patient which is in the vicinity of the target, as much as possible. Treatment verification is one of the most important steps of radiation therapy which has two usual methods, using Port film and EPID. The accuracy and precision of treatment in ...

متن کامل

Learning Compositional Visual Concepts with Mutual Consistency

Compositionality of semantic concepts in image synthesis and analysis is appealing as it can help in decomposing known and generatively recomposing unknown data. For instance, we may learn concepts of changing illumination, geometry or albedo of a scene, and try to recombine them to generate physically meaningful, but unseen data for training and testing. In practice however we often do not hav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013